Parsing Japanese Honorifics in Unification-Based Grammar
نویسندگان
چکیده
This paper presents a unification-based approach to Japanese honorifics based on a version of HPSG (Head-driven Phrase Structure Grammar)ll]121. Utterance parsing is based on lexical specifications of each lexical item, including honorifics, and a few general PSG rules using a parser capable of unifying cyclic feature structures. It is shown that the possible word orders of Japanese honori f ic predicate constituents can be automatically deduced in the proposed f ramework w i thou t independent ly specifying them. Discourse Information Change Rules (DICRs) that a l low resolving a class of anaphors in honorific contexts are also formulated.
منابع مشابه
Efficient HPSG Parsing Algorithm with Array Unification
This paper presents a method for improving parsing performance of parsers for HPSG. The method was obtained by extending Torisawa’s parsing method for HPSG. His parsing method utilizes a CFG compiled from a given HPSG-based grammar, and the parser predicts the possible parse trees with the CFG. Since the amount of unification is reduced because of this prediction, parsing performance is improve...
متن کاملParsing Korean based on Dependency Grammar and GULP
This paper presents a parsing algorithm in Prolog using GULP, based on dependency grammar and unification-based grammar.1 It parses declarative sentences of a free-word-order language, Korean. The dependency grammar accepts free order of the words in a sentence. Unification-based features separate the grammar from the parsing algorithm and also simplify the notation of the grammar. GULP (Graph ...
متن کاملA Strategy for the Syntactic Parsing of Corpora: from Constraint Grammar Output to Unification-based Processing
This paper presents a strategy for syntactic analysis based on the combination of two different parsing techniques: lexical syntactic tagging and phrase structure syntactic parsing. The basic proposal is to take advantage of the good results on lexical syntactic tagging to improve the whole performance of unification-based parsing. The syntactic functions attached to every word by the lexical s...
متن کاملTranslating a Unification Grammar with Disjunctions into Logical Constraints
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification grammar formalisms based on path equations and lists of pairs of labels and values are better than those based on first-order terms in that the former is easier to describe and to understand. Parsing with term-based internal...
متن کاملRelating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical data until complexity theory can more accurately predict the practical behaviour...
متن کامل